A magic rectangle set on Abelian groups and its application

نویسندگان

چکیده

A $\Gamma$-magic rectangle set $MRS_{\Gamma}(a, b; c)$ of order $abc$ is a collection $c$ arrays $(a\times b)$ whose entries are elements group $\Gamma$, each appearing once, with all row sums in every equal to constant $\omega\in \Gamma$ and column $\delta \in \Gamma$. In this paper we prove that for $\{a,b\}\neq\{2^{\alpha},2k+1\}$ where $\alpha$ $k$ some natural numbers, MRS$_{\Gamma}(a, b;c)$ exists if only $a$ $b$ both even or $|\Gamma|$ odd $\Gamma$ has more than one involution. Moreover obtain sufficient necessary conditions existence b)$=MRS$_{\Gamma}(a, b;1)$.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A \varGamma -magic Rectangle Set and Group Distance Magic Labeling

A Γ -magic rectangle set MRSΓ (a, b; c) of order abc is a collection of c arrays (a× b) whose entries are elements of group Γ , each appearing once, with all row sums in every rectangle equal to a constant ω ∈ Γ and all column sums in every rectangle equal to a constant δ ∈ Γ . In the paper we show that if a and b are both even then MRSΓ (a, b; c) exists for any Abelian group Γ of order abc. Fu...

متن کامل

On Restricted Set Addition in Abelian Groups

Let A be a set of k elements of an Abelian group G in which the order of the smallest nonzero subgroup is at least 2k − 3. Then the number of different elements of G that can be written in the form a + a′, where a, a′ ∈ A, a 6= a′, is at least 2k − 3, as it has been shown in [12]. Here we give yet another proof of this result.

متن کامل

Quantum Error-Correction Codes on Abelian Groups

We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.

متن کامل

Magic labellings of graphs over finite abelian groups

A total labelling of a graph with v vertices and e edges is a one-to-one map taking the vertices and edges onto the set {1, 2, 3, . . . , v + e}. A labelling can be used to define a weight for each vertex and edge. For a vertex the weight is the sum of the label of the vertex and the labels of the incident edges. For an edge {x, y} the weight is the sum of the label of the edge and the labels o...

متن کامل

On component extensions locally compact abelian groups

Let $pounds$ be the category of locally compact abelian groups and $A,Cin pounds$. In this paper, we define component extensions of $A$ by $C$ and show that the set of all component extensions of $A$ by $C$ forms a subgroup of $Ext(C,A)$ whenever $A$ is a connected group. We establish conditions under which the component extensions split and determine LCA groups which are component projective. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2021

ISSN: ['1872-6771', '0166-218X']

DOI: https://doi.org/10.1016/j.dam.2020.08.029